A lower bound for intuitionistic logic

نویسنده

  • Pavel Hrubes
چکیده

We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL-tautologies A1, A2, . . . s.t. every IL-proof of Ai must have a number of proof-lines exponential in terms of the size of Ai. We show that the results do not apply to the system of classical logic and we obtain an exponential speed-up between classical and intuitionistic logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of the Disjunction and ExistentialProperties in

This paper considers the computational complexity of the disjunc-tion and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A _ B, a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunct...

متن کامل

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC

In this paper we extend the notion of  degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and  introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...

متن کامل

The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic

This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A ∨ B , a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunct...

متن کامل

Evaluating Construction Projects by a New Group Decision-Making Model Based on Intuitionistic Fuzzy Logic Concepts

Select an appropriate project is a main key for contractors to increase their profits. In practice, in this area the uncertainty and imprecise of the involved parameters is so high. Therefore, considering fuzzy sets theory to deal with uncertainly is more appreciate. The aim of this paper is present a multi-criteria group decision-making model under an intuitionistic fuzzy set environment. Henc...

متن کامل

The Complexity of Disjunction in Intuitionistic Logic

In the formal study of security protocols and access control systems, fragments of intuitionistic logic play a vital role. These are required to be efficient, and are typically disjunction-free. In this paper, we study the complexity of adding disjunction to these subsystems. Our lower bound results show that very little needs to be added to disjunction to get co-NP-hardness, while our upper bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 146  شماره 

صفحات  -

تاریخ انتشار 2007